- bipartite number
- мат.двудольное число
English-Russian scientific dictionary. 2008.
bipartite number
Смотреть что такое "bipartite number" в других словарях:
Bipartite — means having two parts, or an agreement between two parties. More specifically, it may refer to any of the following:* 2 (number)In mathematics: * Bipartite graph * Bipartite Cubic, a type of Cubic function * Bipartite matching, a type of… … Wikipedia
bipartite — bipartite, bipartisan Affecting two parties (‘bipartite agreement’) or divided into two parts. The term is mostly employed in reference to formal economic and political negotiations and arrangements. For example, a number of social scientists… … Dictionary of sociology
Bipartite graph — In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V ; that is, U and V are independent sets.… … Wikipedia
Bipartite dimension — In the mathematical field of graph theory, the bipartite dimension of an graph G=(V,E) is the minimum number of bicliques, that is, complete bipartite subgraphs, needed to cover all edges in E. A collection of bicliques covering all edges in G is … Wikipedia
Complete bipartite graph — A complete bipartite graph with m = 5 and n = 3 Vertices n + m Edges mn … Wikipedia
Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… … Wikipedia
Domatic number — A domatic partition. In graph theory, a domatic partition of a graph G = (V,E) is a partition of V into disjoint sets V1, V2,...,VK such that each Vi is a dominati … Wikipedia
Dissociation number — In the mathematical discipline of graph theory, a subset of vertices in a graph G is called dissociation if it induces a subgraph with maximum degree 1. The number of vertices in a maximum cardinality dissociation set in G is called the… … Wikipedia
Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… … Wikipedia
chromatic number — noun The smallest number of colours needed to colour a connected graph The chromatic number of a complete graph is and the chromatic number of the bipartite graph two … Wiktionary
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
